Reliable Generation of High-Performance Matrix Algebra
نویسندگان
چکیده
منابع مشابه
A Reliable Generation of High-Performance Matrix Algebra
Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) to obtain portable high performance. However, many numerical algorithms require several BLAS calls in sequence, and those successive calls result in suboptimal performance. The entire sequence needs to be optimized in concert. Instead of vendor-tuned BLAS, a programmer could start with source code in Fortr...
متن کاملTowards reliable software performance modelling using stochastic process algebra
The aim of any modelling exercise is to develop a better understanding of the system that is being studied, however it is unfortunately not always easy to understand abstract performance models or the metrics that are derived from them. In this tutorial paper we focus on the facilitation of more reliable performance prediction through better understanding of models and solutions in the context ...
متن کاملInteractive Form-Generation in High-Performance Architecture Theory
Architecture as a designerly way of thinking and knowing is to interact with its environment. The manuscript is to speculate “interactive form-generation” based on high-performance architecture theory, and discuss the precursors and the potentials. The research aims to explore and determine the roots, aspects of interactive architecture as a part of performance-based design in contemporary arch...
متن کاملHigh-Performance Matrix Multiplication
This document describes techniques for speeding up matrix multiplication on some high-performance computer architectures, including the IBM RS-6000, the IBM 3090/600S-VF, the MIPS RC3240 and RC6280, the Stardent 3040, and the Sun SPARCstation. The methods illustrate general principles that can be applied to the inner loops of scientific code.
متن کاملHigh-Performance Computer Algebra: A Hecke Algebra Case Study
We describe the first ever parallelisation of an algebraic computation at modern HPC scale. Our case study poses challenges typical of the domain: it is a multi-phase application with dynamic task creation and irregular parallelism over complex control and data structures. Our starting point is a sequential algorithm for finding invariant bilinear forms in the representation theory of Hecke alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2015
ISSN: 0098-3500,1557-7295
DOI: 10.1145/2629698